Topological Structures on Vertex Set of Digraphs
نویسندگان
چکیده
Relation on a set is simple mathematical model to which many real-life data can be connected. A binary relation always represented by digraph. Topology generated relations the . In this direction, study will consider different classical categories of topological spaces whose topology defined adjacency and reachability vertex directed graph. This paper analyses some properties these topologies studies closure interior subgraphs Further, applications digraphs in biological systems are cited.
منابع مشابه
Vertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملTranspose on vertex symmetric digraphs
In [2] (and earlier in [3]), we defined several global communication tasks (universal exchange, universal broadcast, universal summation) on directed or vertex symmetric networks. In that paper, we mainly focused on universal broadcast. In [4], we discussed universal sum. Here we continue this work and focus on universal exchange (transpose) in directed vertex symmetric graphs. Introduction. In...
متن کاملBlock Line Cut Vertex Digraphs of Digraphs
In this paper, the digraph valued function(digraph operator), namely the block line cut vertex digraph BLC(D) of a digraph D is defined, and the problem of reconstructing a digraph from its block line cut vertex digraph is presented. Outer planarity, maximal outer planarity, and minimally non-outer planarity properties of these digraphs are discussed.
متن کاملOn vertex balance index set of some graphs
Let Z2 = {0, 1} and G = (V ,E) be a graph. A labeling f : V → Z2 induces an edge labeling f* : E →Z2 defined by f*(uv) = f(u).f (v). For i ε Z2 let vf (i) = v(i) = card{v ε V : f(v) = i} and ef (i) = e(i) = {e ε E : f*(e) = i}. A labeling f is said to be Vertex-friendly if | v(0) − v(1) |≤ 1. The vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. In this paper ...
متن کاملOn Vosperian and Superconnected Vertex-Transitive Digraphs
We investigate the structure of a digraph having a transitive automorphism group where every cutset of minimal cardinality consists of all successors or all predecessors of some vertex. We improve most of the existing results in this area.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Baghdad Science Journal
سال: 2023
ISSN: ['2078-8665', '2411-7986']
DOI: https://doi.org/10.21123/bsj.2023.8432